This paper realize an approach to filling pattern based on feasible area.

本文实现了一种基于可行域的图案填充的方法。

In pre-matching, the searching strategy defines a gridding unit as a step with SSDA method, so it can quickly eliminate non-matching area and gain feasible area for precise-matching.

在预匹配过程中，由于地磁数据的离散性，搜索步长定为一个基本网格单元，并与序贯相似检测原则相结合，这样可快速排除非匹配区，筛选得到精匹配所需要的可行区域。

The Transportation Problem exists"more-for-less"paradox, which because the loose-constrained model has broadened the restriction, enlarged the feasible area, and bring new optimal solution.

运输问题存在“多反而少”现象，这是由于在松约束模型中放宽了约束条件，使得可行域变大，产生了新的最优解。